Choosing Good Distance Metrics and Local Planners for Probabilistic Roadmap Methods

نویسندگان

  • Nancy M. Amato
  • O. Burçhan Bayazit
  • Lucia K. Dale
  • Christopher Jones
  • Daniel Vallejo
چکیده

This paper presents a comparative evaluation of different distance metrics and local planners within the context of probabilistic roadmap methods for motion planning. Both C-space and Workspace distance metrics and local planners are considered. The study concentrates on cluttered three-dimensional Workspaces typical, e.g., of mechanical designs. Our results include recommendations for selecting appropriate combinations of distance metrics and local planners for use in motion planning methods, particularly probabilistic roadmap methods. We find that each local planner makes some connections than none of the others do — indicating that better connected roadmaps will be constructed using multiple local planners. We propose a new local planning method we call rotate-at-s that outperforms the common straight-line in C-space method in crowded environments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Choosing Good Distance Metria and Local Planners for Probabilistic Roadmap Methods*

This paperpresents a cumpurative evuluatiun uf different distance metrics and local planners within the context of probabilistic roadmap methods f i r motion planning. Both C-space and Workspace distance metrics and local planners are considered. The study concentrates on cluttered three-dimensional Workspaces typical, e.g., of mechanical designs. Our results include recommendations for selecti...

متن کامل

Constructing probabilistic roadmaps with powerful local planning and path optimization

This paper describes a new approach to probabilistic roadmap construction for path planning. The novel feature of the planner is that it uses a powerful local planner to produce highly connected roadmaps and path optimization to maintain the rapid query processing by a fast local operator. While most previous approaches obtain good roadmaps by advanced sampling methods, the presented approach c...

متن کامل

Adaptive Strategies for Probabilistic Roadmap Construction

This paper presents an experimental study of prospects for using adaptable local search techniques in probabilistic roadmap based motion planning. The classical PRM approach uses a single fast and simple local planner to build a network representation of the configuration space. Advanced PRM planners utilize heuristic sampling techniques and combine multiple local planners. The planner describe...

متن کامل

On the Probabilistic Foundations of Probabilistic Roadmaps

Probabilistic roadmap (PRM) planners [5, 16] solve apparently difficult motion planning problems where the robot's configuration space C has dimensionality six or more, and the geometry of the robot and the obstacles is described by hundreds of thousands of triangles. While an algebraic planner would be overwhelmed by the high cost of computing an exact representation of the free space F , defi...

متن کامل

On Finding Narrow Passages with Probabilistic Roadmap Planners

A probabilistic roadmap is a network of simple paths connecting collision-free conngurations obtained by sampling a robot's connguration space at random. Several probabilistic roadmap planners have solved unusually diicult path-planning problems, but their ee-ciency remains disappointing when the free space contains narrow passages. This paper provides foundations for understanding the eeect of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Robotics and Automation

دوره 16  شماره 

صفحات  -

تاریخ انتشار 1998